|
In computer science, the count-distinct problem〔 〕 (also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements. This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks. ==Formal definition== : Instance: A stream of elements with repetitions, and an integer . Let be the number of distinct elements, namely , and let these elements be . : Objective: Find an estimate of using only storage units, where . An example of an instance for the cardinality estimation problem is the stream: . For this instance, . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Count-distinct problem」の詳細全文を読む スポンサード リンク
|